25 Belief Functions : The Disjunctive Rule of Combination and the Generalized Bayesian Theorem ∗

نویسندگان

  • Philippe Smets
  • P. Smets
چکیده

We generalize the Bayes’ theorem within the transferable belief model framework. The Generalized Bayesian Theorem (GBT) allows us to compute the belief over a space Θ given an observation x ⊆ X when one knows only the beliefs over X for every θi ∈ Θ. We also discuss the Disjunctive Rule of Combination (DRC) for distinct pieces of evidence. This rule allows us to compute the belief over X from the beliefs induced by two distinct pieces of evidence when one knows only that one of the pieces of evidence holds. The properties of the DRC and GBT and their uses for belief propagation in directed belief networks are analysed. The use of the discounting factors is justfied. The application of these rules is illustrated by an example of medical diagnosis.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Belief Functions: The Disjunctive Rule of Combination and the Generalized Bayesian Theorem

We generalize the Bayes’ theorem within the transferable belief model framework. The Generalized Bayesian Theorem (GBT) allows us to compute the belief over a space Θ given an observation x ⊆ X when one knows only the beliefs over X for every θi ∈ Ω. We also discuss the Disjunctive Rule of Combination (DRC) for distinct pieces of evidence. This rule allows us to compute the belief over X from t...

متن کامل

Belief Function Propagation in Directed Evidential Networks

In this paper, we propose a computational data structure based on the binary join tree where the independence relations of the original directed evidential networks (DEVN) are maintained. The proposed solution uses disjunctive rule of combination (DRC) and generalized Bayesian theorem (GBT), which make possible the use of the conditional belief functions directly for reasoning in the DEVN.

متن کامل

Conjunctive and Disjunctive Combination of Belief Functions Induced by Non Distinct Bodies of Evidence

Dempster’s rule plays a central role in the theory of belief functions. However, it assumes the combined bodies of evidence to be distinct, an assumption which is not always verified in practice. In this paper, a new operator, the cautious rule of combination, is introduced. This operator is commutative, associative and idempotent. This latter property makes it suitable to combine belief functi...

متن کامل

A Reasoning Method in Conditional Evidential Networks based on Dezert-Smarandache Model

Aiming to solving the problem that the evidence information based on Dezert-Smarandache (DSm) model can not be fused effectively in Conditional Evidential Network based on Smets/DS model (ENC), a reasoning method in Conditional Evidential Network based on DSm model is proposed. First, the conditional reasoning formular in Conditional Evidential Network based on DSm model is proved and the reaso...

متن کامل

Algebraic Structures Related to the Combination of Belief Functions

Based on a new demand — the commutativity of belief functions combination with refinement/coarsening of the frame of discernment — the role of the disjunctive rule of combination has increased. To compare the nature of this rule with a more frequent but also more controversional one, i.e. with Dempster’s rule, an algebraic analysis was used. The basic necessary definitions both from the Dempste...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008